minimum path cover造句
例句与造句
- The Hamiltonian path problem is NP-complete, and hence the minimum path cover problem is NP-hard.
- A minimum path cover consists of one path if and only if there is a Hamiltonian path in " G ".
- It's difficult to find minimum path cover in a sentence. 用minimum path cover造句挺难的